Text Schema Mining Using Graphs and Formal Concept Analysis
نویسندگان
چکیده
A Linearly Complex Model for Knowledge Representation . . . . . . . . . . . . . . . . . .20 Janos Sarbo and József Farkas Relation Graphs: A Structure for Representing Relations in Contextual Logic of Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 Silke Pollandt Information Transfer across Simple Concept Graphs . . . . . . . . . . . . . . . . . . . . . . . 48 Grit Malik Relational Scaling and Databases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 Joachim Hereth
منابع مشابه
Conceptual Modeling with Formal Concept Analysis on Natural Language Texts
The paper presents conceptual modelling technique on natural language texts. This technique combines the usage of two conceptual modeling paradigms: conceptual graphs and Formal Concept Analysis. Conceptual graphs serve as semantic models of text sentences and the data source for concept lattice – the basic conceptual model in Formal Concept Analysis. With the use of conceptual graphs the Text ...
متن کاملMining at Detail Level Using Conceptual Graphs *
Text mining is defined as knowledge discovery in large text collections. It detects interesting patterns such as clusters, associations, deviations, similarities, and differences in sets of texts. Current text mining methods use simplistic representations of text contents, such as keyword vectors, which imply serious limitations on the kind and meaningfulness of possible discoveries. We show ho...
متن کاملLinked Data Querying through FCA-based Schema Indexing
The efficiency of SPARQL query evaluation against Linked Open Data may benefit from schema-based indexing. However, many data items come with incomplete schema information or lack schema descriptions entirely. In this position paper, we outline an approach to an indexing of linked data graphs based on schemata induced through Formal Concept Analysis. We show how to map queries onto RDF graphs b...
متن کاملThe Maximal Relation Based on A Given Relation Schema and Its Concept Lattice
Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation R based on a relation schema S(A). Firstly, we analyze concepts in R and the concept lattice L(R), and there are some important results as follows: for any two con...
متن کاملText Mining at Detail Level Using Conceptual Graphs
Text mining is defined as knowledge discovery in large text collections. It detects interesting patterns such as clusters, associations, deviations, similarities, and differences in sets of texts. Current text mining methods use simplistic representations of text contents, such as keyword vectors, which imply serious limitations on the kind and meaningfulness of possible discoveries. We show ho...
متن کامل